Approximate Membership of Sets: A Survey
نویسنده
چکیده
The task of representing a set so as to support membership queries is a common one in computer science. If space is no object, a complete dictionary may provide accurate QUERYing in good runtime. If space is at a premium and the size of the set uncertain, Bloom filters and hash compaction provide good approximations. If the size is completely unknown, a modified Bloom filter provides very good runtime, with minimal extra error. This survey briefly explores the applications of dictionaries, Bloom filters, and hash compaction techniques to the set membership problem, observing details of their implementations and tradeoffs in their accuracy. We conclude with a recommendation for when to use each, respectively.
منابع مشابه
An Approach for Accurate Edging using Dynamic Membership Functions
In this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. The difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. In this proposed method, a 3×3 window is dragged on the photo. For each block, 12 point sets will be defined, each including two non-overlapping po...
متن کاملTIME-VARYING FUZZY SETS BASED ON A GAUSSIAN MEMBERSHIP FUNCTIONS FOR DEVELOPING FUZZY CONTROLLER
The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملSoft Computing Based on a Modified MCDM Approach under Intuitionistic Fuzzy Sets
The current study set to extend a new VIKOR method as a compromise ranking approach to solve multiple criteria decision-making (MCDM) problems through intuitionistic fuzzy analysis. Using compromise method in MCDM problems contributes to the selection of an alternative as close as possible to the positive ideal solution and far away from the negative ideal solution, concurrently. Using Atanasso...
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کامل